public class max {
        public static int maxSubarraySum(int[] nums) {
            if (nums == null || nums.length == 0) {
                return 0;
            }
            int currentSum = nums[0];
            int maxSum = nums[0];
            for (int i = 1; i < nums.length; i++) {
                currentSum = Math.max(nums[i], currentSum + nums[i]);
                maxSum = Math.max(maxSum, currentSum);
            }
            return maxSum;
        }
        public static void main(String[] args) {
            int[] arr1 = {1, -2, 3, 5, -1};
            int[] arr2 = {1, -2, 3, -8, 5, 1};
            int[] arr3 = {1, -2, 3, -2, 5, 1};
            System.out.println("数组{1, -2, 3, 5, -1}的最大子数组和：" + maxSubarraySum(arr1));
            System.out.println("数组{1, -2, 3, -8, 5, 1}的最大子数组和：" + maxSubarraySum(arr2));
            System.out.println("数组{1, -2, 3, -2, 5, 1}的最大子数组和：" + maxSubarraySum(arr3));
        }
    }

